Layout method and system in a display area for disconnected dynamic networks

ABSTRACT

A layout method in a display area for multiple graph components in a dynamic network. The multiple graph components are sorted according to their importance into a first subset S 1  and a second subset S 2  according to the order of their importance. The first subset S 1  is divided into an upper subset C p  including only the most important graph component and a lower subset C m . The display area is divided into display portions S 1 ′ and S 2 ′ proportionally according to the importance values of the first subset S 1  and the second subset S 2 . Display portion S 1 ′ is divided into display portions C p ′ and C m ′ proportionally according to the importance values of the upper subset C p  and the lower subset C m . The first division and the second division and the corresponding division of the display area are executed iteratively until the aspect ratio of display portion C p ′ is close to 1.

CROSS REFERENCE TO RELATED APPLICATION

This application claims priority under 35 U.S.C. 119 from Chinese PatentApplication 200910136964.8, filed Apr. 30, 2009, the entire contents ofwhich are incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to visualization. More particularly, thepresent invention relates to a layout method and system in a displayarea for disconnected dynamic networks.

2. Description of Related Art

Network datasets, such as social networks, internet and financialnetworks etc. are widely available in many fields. As one of theeffective techniques to demonstrate relationships in networks, graphshave been studied for a long time and many layout methods and usefulinteractive tools have been proposed to help users to find outinteresting patterns in these network datasets. Recently, more and moreattentions are moving into dynamic networks since many networks in reallife change over time. Previous methods work well for static networks,but for dynamic networks, they fail to keep temporal coherence andcannot show stable transitions from frame to frame. Therefore, severalapproaches are designed for visualizing the updates of dynamic networksstably and smoothly by considering both the layout algorithms and theanimation techniques.

For disconnected dynamic networks, one of the most popular networks, thevisualization methods mentioned above cannot be directly adopted, sincenew challenges rose in which major challenges are as following. Firstly,it is quite difficult to lay out the disconnected components within thenetworks on the screen clearly and informatively when they are static,not to mention if they are dynamically changing; secondly, it is alsovery difficult to keep the changes of the multiple components shownsmoothly and stably. If movements between the current location and theprevious location are simply minimized, it may cause great overlap whensome components are merged together in certain time frame.

There is need for a method and system to address the problems mentionedabove.

SUMMARY OF THE INVENTION

According to an aspect of the present invention, a computer implementedlayout method for multiple graph components in a display area of acomputer system includes: dividing the multiple graph components into afirst subset S₁ and a second subset S₂ according to the order of theirimportance, wherein the first subset S₁ includes at least the mostimportant graph component; dividing the first subset S₁ into an uppersubset C_(p) that includes only the most important graph component and alower subset C_(m); dividing the display area into display portions S₁′and S₂′ proportionally according to importance values of the firstsubset S₁ and the second subset S₂; dividing the display portion S₁′into display portions C_(p)′ and C_(m)′ proportionally according toimportance values of the upper subset C_(p) and the lower subset C_(m);and iteratively executing the steps of dividing until the aspect ratioof display portion C_(p)′ is approximately 1.

According to another aspect of the present invention, a layout systemfor displaying multiple graph components in a disconnected dynamicnetwork includes: a first division means for performing a first divisionto divide the multiple graph components into a first subset S₁ and asecond subset S₂ according to the order of their importance, wherein thefirst subset S₁ includes at least the most important graph component; asecond division means for performing a second division to divide thefirst subset S₁ into an upper subset C_(p) which includes only the mostimportant graph component and a lower subset C_(m) which includes theother graph components; a first display area division means for dividingthe display area into display portions S₁′ and S₂′ proportionallyaccording to the importance values of the first subset S₁ and the secondsubset S₂; a second display area division means for dividing the displayportion S₁′ into display portions C_(p)′ and C_(m)′ proportionallyaccording to the importance values of the upper subset C_(p) and thelower subset C_(m); and an executing means for causing execution by (i)the first division means, (ii) the second division means and (iii) thecorresponding display division means iteratively until the aspect ratioof display portion C_(p)′ is approximately 1.

By utilizing the method and system according to the present invention,the layout of the disconnected components within the networks on thescreen can be clear and informative, at the same time the updates ofdynamic networks can be shown stably and smoothly.

BRIEF DESCRIPTIONS OF THE DRAWINGS

The present invention will be better understood from the followingdescription when taken in conjunction with the accompanying drawings. Inthe accompanying drawings, the same or corresponding technical featuresor components will be represented by the same or corresponding referencesigns. The accompanying drawings together with the following detaileddescription are included in this specification and form a part of thespecification, which are used to describe the principle and advantagesof the present invention and preferred embodiments of the presentinvention by way of example. In the figures:

FIG. 1 is an example of disconnected dynamic network illustrated usinggraphs;

FIG. 2 is an exemplary layout method in a display area for adisconnected dynamic network according to the present invention;

FIG. 3 a-3 c shows the results of the division of the display areaaccording to the layout method of the present invention;

FIG. 4 shows the results of the division of the display area accordingto an embodiment of the present invention;

FIG. 5 a shows the results of the division of the display area accordingto an embodiment of the present invention;

FIG. 5 b is the triple tree structure corresponding to the division ofthe display area of FIG. 5 a;

FIG. 6 is an exemplary layout system in a display area for adisconnected dynamic network according to the present invention;

FIG. 7 is a computer system structure that the present invention can beapplied to.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

In the following description, numerous particular details are describedso that the present invention can be fully understood. However, it isobvious to a person skilled in the art that implementation of thepresent invention may not have these particular details. In addition, itshould be understood that the present invention is not limited to theparticular embodiments described herein. Instead, it is contemplated toimplement the present invention by using any combination of thefollowing features and elements, regardless of whether they involvedifferent embodiments. Therefore, the following aspects, features,embodiments and advantages are only used for illustration and should notbe regarded as the elements or definitions of the attached claims,unless indicated explicitly in the claims.

It should also be noted that, for purpose of clarity, indications anddescriptions of components and processes known by a person skilled inthe art which are not involved in the present invention are omitted inthe drawings and the specification.

Referring now to FIG. 1, an example of disconnected dynamic networkusing graphs is illustrated. In FIG. 1, dashed line boxes representgraph components of a disconnected dynamic network. It should be notedthat the dashed line boxes in FIG. 1 is only for the purpose ofillustrating graph components and can be shown or hidden whenvisualizing the network.

A basic idea of the present invention is to put each of the graphcomponents of a disconnected dynamic network respectively into each ofthe independent packing cells, while the packing cells are the optimaldivision of the display area.

According to a basic idea of the present invention, the display area isdivided first to form multiple packing cells that are independent witheach other. The multiple packing cells are used to display graphcomponents of the disconnected dynamic network respectively. Whendividing the display area, at least one of the following requirementsshould be considered.

1) Graph components with higher importance should occupy larger displayarea.

2) The aspect ratio of each independent packing cell should be close to1 as much as possible.

3) Graph components with the highest importance should occupy the centerof the display area.

4) The layout should consider the demand that changes of the graphcomponents can be shown stably and smoothly when the disconnecteddynamic network evolves with time.

Considering the above requirements, the layout in FIG. 1 is not a goodexample.

Now referring to FIG. 2, an exemplary layout method in a display areafor a disconnected dynamic network according to the present invention isshown. The method 200 of FIG. 2 starts from step 202. In the followingstep 204, sorting the multiple graph components according to theirimportance; then in step 206, a first division is performed to dividethe sorted multiple graph components into a first subset S₁ and a secondsubset S₂ according to the order of their importance, wherein the firstsubset S₁ includes at least the most important graph component; and thenin step 208, a second division is performed to divide the first subsetS₁ into a upper subset C_(p) and a lower subset C_(m) according to theorder of their importance, wherein the upper subset C_(p) includes onlythe most important graph component; in the following step 210, dividethe display area into display portions S₁′ and S₂′ proportionallyaccording to the importance values of the first subset S₁ and the secondsubset S₂; then in step 212, divide the display portion S₁′ into displayportions C_(p)′ and C_(m)′ proportionally according to the importancevalues of the upper subset C_(p) and the lower subset C_(m); then instep 214, execute the first division and the second division and thecorresponding division of the display area iteratively until the aspectratio of display portion C_(p)′ is close to 1. It is anticipated tothose skilled art that the division of the display area could beperformed after the division of the graph components into subsets isdone.

For the purpose of description, the method above is described by usingdatasets. Suppose the disconnected dynamic network includes multiplegraph components c₀, c₁, . . . , c_(n), in the specification, it will bedescribed as dataset C={c₀, c₁, . . . c_(n)}, in which n is an integer.The graph components of the disconnected dynamic network may be sortedaccording to their importance in a descending order thus the sortedgraph components set is obtained, here referenced as C={c_(i)|iε[0,n]},in which n is an integer, and the importance order of the multiple graphcomponents is c₀>c₁> . . . >c_(n). Then, a first division is performedto divide the sorted multiple graph components C={c_(i)|iε[0,n]} into afirst subset S₁={c_(i)|iε[0,k]} and a second subset S₂={c_(i)|iε[k+1,n]}according to the importance order, in which n>k≧0 and k is an integer.Then, a second division is performed to divide the first subsetS₁={c_(i)|iε[0,k]} into an upper subset C_(p)={c₀} and a lower subsetC_(m)={S₁−C_(p)} according to the order of their importance.

The display area is then divided into display portions S₁′ and S₂′proportionally according to the importance values of the first subset S₁and the second subset S₂ as well as the display portion S₁′ into displayportions C_(p)′ and C_(m)′ proportionally according to the importancevalues of the upper subset C_(p) and the lower subset C_(m). Executingthe first division, second division and corresponding division of thedisplay area iteratively, till the aspect ration of display portionC_(p)′ is close to 1.

Preferably, n/2>k≧0 is used for the iterative execution of the divisionthus half of the computation is saved. The division mentioned herein isto divide the display area according to the importance of thecorresponding graph components of the disconnected dynamic network.First, the most important graph component is divided and the aspectratio of the display portion for the most important graph component iscomputed each time the division is executed, then the division in whichthe aspect ratio of the display portion for the most important graphcomponent is close to 1 is chosen as the final division of the displayarea.

By way of iterative execution using importance as a parameter, therequirements 1) Graph components with higher importance should occupylarger display area; and 2) The aspect ratio of each independent packingcell should be close to 1 as much as possible can be satisfied. Withconsidering the importance of the graph components of the disconnecteddynamic network, the focus of the layout as well as the structure of thedisconnected dynamic network can be shown more clearly compared withprior arts.

In the following the results of the division of the display area isdescribed with FIG. 3. Here it is supposed that there are six graphcomponents in the disconnected dynamic network, graph components setC={c_(i)|iε[0,n]} is used to represent the graph components of thenetwork after sorting in a descending order, in which i=6, the order ofimportance for each graph components is c₀>c₁>, . . . ,>c₆. Weight setW={w_(i)|iε[0,n]} is used to represent the importance of each graphcomponents in which i=6.

According to the embodiment mentioned above, a first division isperformed to graph components set C={c_(i)|ε[0,n]}. The graph componentsset C={c_(i)|ε[0,n]} is divided into subset S₁={c_(i)|iε[0,k]} andsubset S₂={c_(i)|iε[k+1,n]}, in which n>k≧0 and k is an integer. Whenk=0, S₁={c₀}, S₂={c₁, c₂, c₃, c₄, c₅, c₆}. The display area is dividedaccording to the importance values of the subsets S₁ and S₂proportionally, thus display portions S₁′ and S₂′ are formed. As theweights of the subsets S₁ and S₂ are W₁={w₀} and W₂={w₁, w₂, w₃, w₄, w₅,w₆}, the display portions S₁′ and S₂′ are divided according to theimportance values of the subsets S₁ and S₂, i.e. S₁′=W₁/(W₁+W₂) andS₂′=W₂/(W₁+W₂), as shown in FIG. 3 a.

In FIG. 3 a the display area is divided vertically into display portionsS₁′ and S₂′. This is just an exemplary division. Those skilled in theart will understand that the display area could be divided horizontallyinto display portions S₁′ and S₂′. Then, a second division of subset S₁is performed to form subsets C_(p)={c₀} and C_(m)={S₁−C_(p)}. When k=0,C_(p)={c₀} and C_(m)={ø}. Because C_(m)={ø}, the display portion S₁′remains unchanged, i.e., the results remains the same as shown in FIG. 3a. Then iteratively executing the method mentioned above with n/2>k≧0.When k=1, S₁={c₀, c₁} and S₂={c₂, c₃, c₄, c₅, c₆}.

The display area is divided according to the importance values of thesubsets S₁ and S₂ proportionally, thus display portions S₁′ and S₂′ areformed. As the weights of the subsets S₁ and S₂ are W₁={w₀, w₁} andW₂={w₂, w₃, w₄, w₅, w₆}, the display portions S₁′ and S₂′ are dividedaccording to the importance values of the subsets S₁ and S₂, i.e.S₁′=W₁/(W₁+W₂) and S₂′=W₂/(W₁+W₂), as shown in FIG. 3 b. Then, a seconddivision of subset S₁ is performed to form subsets C_(p)={c₀} andC_(m)={S₁−C_(p)}. When k=1, C_(p=){c₀} and C_(m)={c₁}. The displayportion S₁′ is divided according to the importance values of the subsetsC_(p) and C_(m) proportionally, thus display portions C_(p)′ and C_(m)′are formed.

As the weights of the subsets C_(p) and C_(m) are W_(p)={w₀} andW_(m)={w₁}, the display portions C_(p)′ and C_(m)′ are divided accordingto the importance values of the subsets C_(p) and C_(m), i.e.C_(p)′=W_(p)/(W_(p)+W_(m)) and C_(m)′=W_(m)/(W_(p)+W_(m)), as shown inFIG. 3 b. As shown in FIG. 3 b, the aspect ratio of display portionC_(p)′ is R_(p)=W_(p)/W₁. The R_(p) for other values of k can becalculated accordingly. After the iterative execution of the method withn/2>k≧0 (with k=0, 1, 2, 3 for the example herein), the division thatthe aspect ratio R_(p) of C_(p)′ is close to 1 is chosen as the bestlayout for the disconnected dynamic network. Here the value of k thatmakes the division that the aspect ratio R_(p) of C_(p)′ is close to 1is chosen as the parameter for the layout of the disconnected dynamicnetwork, referred as q1. For example, if k=2, the aspect ratio R_(p) ofC_(p)′ is R_(p)=W_(p)/W₁=0.99, which is close to 1, then k=2 is chosenas the parameter for the layout of the disconnected dynamic network,i.e. q1=2, as shown in FIG. 3 c.

According to another embodiment of the present invention, a thirddivision is performed. Subset S₂={c_(i)|iε[k+1,n]} is divided accordingto the importance order to form subsets C_(l) and C_(r), the displayarea is further divided according to the importance values of subsetsC_(l) and C_(r) proportionally, thus display portions C_(p)′ and C_(m)′are formed. First, a third division is performed thatS₂={c_(i)|iε[k+1,n]} is divided into subsets C_(l)={c_(i)|iε[q1+1,j]}and C_(r)={c_(i)|iε[j+1,n]}, iteratively from j=q1+1 to j=n−1, find thevalue of j that makes C_(l) and C_(r) has the most similar aspect ratio,i.e., the displays area that C_(l)′ and C_(r)′ occupy are close, thevalue of j is recorded as q2. Then, the layout of the display portionsC_(p)′, C_(m)′, C_(l)′ and C_(r)′ corresponding to C_(p), C_(m), C_(l)and C_(r) is shown in FIG. 4, here the requirement that the graphcomponents with the highest importance should occupy the center of thedisplay area is satisfied, and C_(l)′ and C_(r)′ are on each sidevertically.

Here, suppose there are six graph components in the disconnected dynamicnetwork. Subsets C_(p), C_(m), C_(l) and C_(r) compose a triple treestructure T, in which the root node C_(p) of the tree has threesub-trees: center sub-tree C_(m), left sub-tree C_(l) and right sub-treeC_(r), each of which corresponds to respective display portions. Then, afourth division is performed to divide the left sub-tree C_(l) and rightsub-tree C_(r), in which the division is performed according to therules in the following with q2′ represents the value of j that thedivision of C_(l) and C_(r) makes them have the most similar aspectratios.

If the width is greater than the height of the display portions C_(m)′,C_(l)′ or C_(r)′, then perform the first division, the second divisionand the third division iteratively for the lower subset C_(m), the leftsubset C_(l) or the right subset C_(r), until there is only one graphcomponent left in each subset. If the width is less than the height ofthe display portions C_(m)′, C_(l)′ or C_(r)′, rotate the displayportions C_(m)′, C_(l)′ or C_(r)′ for 90 degree and then perform thefirst division, the second division and the third division iterativelyfor the lower subset C_(m), the left subset C_(l) or the right subsetC_(r), until there is only one graph component left in each subset.

Now in connection with FIG. 4, if the width is greater than the heightof the display portion C_(l)′, then perform the first division, thesecond division and the third division iteratively for the left subsetC_(l), and if the width is less than the height of the display C_(l)′,rotate the display portion C_(l)′ for 90 degree and then perform thefirst division, the second division and the third division iterativelyfor the left subset C_(l). if the width is greater than the height ofthe display portion C_(r)′, then perform the first division, the seconddivision and the third division iteratively for the right subset C_(r),and if the width is less than the height of the display C_(r)′, rotatethe display portion C_(r)′ for 90 degree and then perform the firstdivision, the second division and the third division iteratively for theright subset C_(r).

More specifically:

A) for the left sub-tree C_(l):

1) if the width is greater than the height of the display portion C_(l)′that corresponds to the left sub-tree C_(l), divide C_(l) intoC_(l′)={c_(i)|iε[q1+1,n]} and C_(r′)={ø}, i.e., q2′=n, and then thesecond division is performed as it is the left sub-tree;

2) if the width is less than the height of the display portion C_(l)′that corresponds to the left sub-tree C_(l), divide C_(l) intoC_(l′)={ø} and C_(r′)={c_(i)|iε[q1+1,n]}, i.e., q2′=q1, and then thesecond division is performed as it is the right sub-tree; and

B) for the right sub-tree C_(r):

1) if the width is greater than the height of the display portion C_(r)′that corresponds to the right sub-tree C_(r), divide C_(r) intoC_(l′)={ø} and C_(r′)={c_(i)|iε[q1+1,n]}, i.e., q2′=q1, and then thethird division is performed as it is the right sub-tree;

2) if the width is less than the height of the display portion C_(r)′that corresponds to the right sub-tree C_(r), divide C_(r) intoC_(l′)={c_(i)|iε[q1+1,n]} and C_(r′)={ø}, i.e., q2′=n, and then thethird division is performed as it is the left sub-tree.

Create root node t that corresponds to the triple tree T, in which q1and q2 are recorded. Correlate t with dataset C. Create correspondingempty sub-tree nodes t_(l), t_(m) and t_(r) and correlate them withC_(l), C_(m) and C_(r). Iteratively perform the divisions based on thecriteria mentioned above to the center sub-tree C_(m), the left sub-treeC_(l) and the right sub-tree C_(r) if they are not empty and performcorresponding divisions of the display area, until all graph componentshas been placed in the right place, i.e. the layout has been completed.Still using the disconnected network with six graph components as anexample, the layout will look like what is shown in FIG. 5 a after usingthe method of the present invention with the triple tree structure shownin FIG. 5 b.

The division of the display portions to form display portions C_(l′) andC_(r′) according to the weight of the subsets C_(l) and C_(r) is similarto the division of the display area to form display portions S₁′ and S₂′according to the weight of subsets S₁ and S₂ as well as the division ofthe display portions to form display portions C_(p′) and C_(m′)according to the weight of the subsets C_(p) and C_(m), i.e. dividingusing the weight of the graph components, thus no further detaileddescription is presented here.

After implementing the method of the present invention mentioned above,the display portion C_(p)′ is in the center of the display area, C_(m)′beneath C_(p)′, C_(l)′ and C_(r)′ to the left side and right side ofC_(p)′.

Now referring to FIG. 6, in which an exemplary layout system 600 in adisplay area for a disconnected dynamic network according to the presentinvention is shown. The system 600 includes a components sorting means602 for sorting the multiple graph components according to theirimportance; a first division means 604 for performing a first divisionto divide the sorted multiple graph components into a first subset S₁and a second subset S₂ according to the order of their importance,wherein the first subset S₁ includes at least the most important graphcomponent; a second division means 606 for performing a second divisionto divide the first subset S₁ into a upper subset C_(p) and a lowersubset C_(m) according to the order of their importance, wherein theupper subset C_(p) includes only the most important graph component; afirst display area division means 608 for dividing the display area intodisplay portions S₁′ and S₂′ proportionally according to the importancevalues of the first subset S₁ and the second subset S₂; a second displayarea division means 610 for dividing the display portion S₁′ intodisplay portions C_(p)′ and C_(m)′ proportionally according to theimportance values of the upper subset C_(p) and the lower subset C_(m);and executing means 612 for executing the first division and the seconddivision and the corresponding division of the display area iterativelyuntil the aspect ratio of display portion C_(p)′ is close to 1.

In the following, the update method of the disconnected dynamic networkaccording to the present invention is described. As mentioned before,subsets C_(p), C_(m), C_(l) and C_(r) formed a triple tree structure T,in which root node C_(p) has three sub-trees: the center sub-tree C_(m),the left sub-tree C_(l) and the right sub-tree C_(r). Such triple treesaves the latest iterative layout information. If a graph componentc_(i) is deleted, then locate the corresponding node t_(i) in the tripletree structure T and delete the node t_(i), and then locate the parentnode of c_(i), make q1 and q2 of the found tree node minus 1. If a graphcomponent c_(i) is added, then locate the parent node of c_(i) accordingto the location c_(i) is going to be added and make q1 and q2 of thefound tree node add 1. If a graph component c_(i) is moved, then 1)delete c_(i) at the original location; 2) adding c_(i) at the newlocation.

By using the updated q1 and q2, as well as the updated triple treestructure T, the layout method can be utilized again by dividing the newdataset C′ to new subsets C_(p), C_(l), C_(m) and C_(r), and dividingthe display area according to the new subsets C_(p), C_(l), C_(m) andC_(r).

Again, take the disconnected dynamic network includes six graphcomponents as an example, suppose the layout of the last iterative isshown in FIG. 5, the corresponding triple tree structure T is shown inFIG. 5 b.

For the triple tree structure with the root node c₀, q1=2, q2=4; for thetriple tree structure with the root node c₃, q2=3, q1 doesn't exist(because C_(m) and C_(l) of C₃ is empty); for the triple tree structurewith the root node c₁, q2=1, q1 doesn't exist (because C_(m) and C_(r)of C₁ is empty); for the triple tree structure with the root node c₅,q2=5, q1 doesn't exist (because C_(m) and C_(r) of C₅ is empty).

If graph component c₃ is deleted, according to the update methodmentioned above, first locate the corresponding node t₃ in the tripletree structure and delete it (corresponding to c₃), then locate thefather node of t₃, (here is node c₀). Then make q1 and q2 of the foundtree node minus 1, i.e., for the triple tree structure with root nodec₀, q1=1, q2=3. And then divide the new dataset using updated q1 and q2.As for the example, for the dataset C′={c₀, c₁, c₂, c₄, c₅, c₆}, useq1=1, q2=3 (here q2=3 corresponds to c₄) to divide the dataset as wellas the corresponding display area. Thus, after the division, C_(p)={c₀},C_(m)={c₁}, C_(l)={c₂, c₄} and C_(r)={c₅, c₆}.

The basic principle of the present invention is described in conjunctionwith the embodiments above. However, for those skilled in the art, itshould be understood that, each or any step or component of the methodand the apparatus of the present invention may be implemented withhardware, firmware, software or a combination thereof in any computingapparatus (including processors, storage medium and the like) or anetwork of computing apparatuses, which can be done by those skilled inthe art with basic programming skills after reading the specification ofthe present invention.

Therefore, the object of the present invention may also be implementedby executing a program or a series of programs on any computingapparatus. The computing apparatus can be a known general-purposeapparatus. Therefore, the object of the present invention can beimplemented through program products providing program codes thatimplement the method or the apparatus. That is, such a program productalso constitutes the present invention, and storage medium stored withsuch a program product also constitute the present invention.Apparently, the storage medium can be any known storage medium or anystorage medium to be developed in the future.

In case of implementing the embodiments of the present invention bysoftware and/or firmware, a program constituting the software may beinstalled into a computer with dedicated hardware, for example, ageneral-purpose personal computer 700 as shown in FIG. 7 from a storagemedium or a network, and the computer is capable of performing variousfunctions if with various programs installed therein.

In FIG. 7, a Central Processing Unit (CPU) 701 performs variousprocessing based on a program stored in a Read Only Memory (ROM) 702 ora program loaded from a storage section 708 to a Random Access Memory(RAM) 703. In the RAM 703, required data when the CPU 701 performs thevarious processing or the like is also stored as necessary. The CPU 701,the ROM 702, and the RAM 703 are connected to one another via a bus 704.An input/output interface 705 is also connected to the bus 704.

The following components are connected to the input/output interface705: an input section 706 including a keyboard, a mouse, or the like; anoutput section 707 including a display such as a Cathode Ray Tube (CRT),a Liquid Crystal Display (LCD), or the like, and a loudspeaker or thelike; the storage section 708 including a hard disk or the like; and acommunication section 709 including a network interface card such as aLAN card, a modem, or the like. The communication section 709 performscommunication processing via the network such as the Internet.

A drive 710 is also connected to the input/output interface 705 asnecessary. A removable medium 711, such as a magnetic disk, an opticaldisk, a magneto-optical disk, a semiconductor memory, or the like, isinstalled on the drive 710 as necessary, so that a computer program readtherefrom may be installed into the storage section 708 as necessary.

In the case where the above-described series of processing isimplemented with software, the program that constitutes the software maybe installed from a network such as the Internet or a storage mediumsuch as the removable medium 711.

Those skilled in the art would appreciate that, the storage medium isnot limited to the removable medium 711 having the program storedtherein as illustrated in FIG. 7, which is distributed separately fromthe device for providing the program to the user. Examples of theremovable medium 711 include a magnetic hard or floppy disk, an opticaldisk (including a Compact Disk-Read Only Memory (CD-ROM) and a DigitalVersatile Disk (DVD)), a magneto-optical disk (including a Mini-Disk(MD) (registered trademark)), and a semiconductor memory. Alternatively,the storage medium may be the ROM 702, the hard disk contained in thestorage section 708, or the like, which has the program stored thereinand is distributed to the user together with the device that containsthem.

It should also be noted that, in the apparatus and method of the presentinvention, apparently the components or the steps may be decomposedand/or recombined. The decomposition and/or recombination should beconsidered as equivalent solutions of the present invention. Moreover,the steps performing the above described series of processing can, butnot necessarily, be performed chronologically in the natural order ofthe description. Some steps may be performed in parallel orindependently of one another.

The present invention and its advantages have been described in detail.However, it should be understood by those skilled in the art thatvarious modifications, combinations, sub-combinations and alterationsmay occur depending on design and other factors insofar as they arewithin the scope of the appended claims or the equivalents thereof.Moreover, the terms “include”, “including,” “include” or any othervariations thereof, are intended to cover a non-exclusive inclusion sothat a process, method, article, or device that includes a list ofelements does not only include these elements but also may include otherelements not explicitly listed or inherent to such process, method,article, or device. An element preceded by “a” or “an” does not, ifwithout more constraints, preclude the existence of additional identicalelements in the process, method, article, or device that includes theelement.

We claim:
 1. A computer implemented layout method in a display area of acomputer system for disconnected dynamic network, in which thedisconnected dynamic network includes multiple graph components, themethod comprising, selecting a test threshold member of the multiplegraph components; dividing the multiple graph components into a firstsubset S₁and a second subset S₂ according to the order of theirimportance values, wherein each of the graph components in the firstsubset S₁has an importance value greater than or equal to the importancevalue of the test threshold member, and wherein each of the graphcomponents of the second subset S₂ has an importance value less than orequal to the importance value of the test threshold member; dividing thefirst subset S₁into a lower subset C_(m) and an upper subset C_(p),wherein the upper subset C_(p) includes only the graph component havingthe highest importance value; dividing the display area into displayportions S₁′ and S₂′ proportionally according to the importance valuesof the first subset S₁ and the second subset S₂; dividing the displayportion S₁′ into display portions C_(p)′ and C_(m)′ proportionallyaccording to the importance values of the upper subset C_(p) and thelower subset C_(m); iteratively executing selecting the test thresholdmember, dividing the display area into display portions, and dividingthe display portion S₁′, until the aspect ratio of display portionC_(p)′ is approximately 1; selecting, as a final threshold member, theimportance value of the test threshold member that resulted in theaspect ratio of the display portion C_(p) being approximately 1; andselecting for the display area a layout resulting from the dividing thedisplay area into display portions and the dividing the display portionS₁′, wherein the divisions are performed with the importance value ofthe final threshold member.
 2. The method of claim 1, furthercomprising, dividing the subset S₂ into a left subset C_(l) and a rightsubset C_(r), in which the total importance value of the left subsetC_(l) is approximately that of the right subset C_(r) and dividing thedisplay portion other than C_(p)′ and C_(m)′ into display portionsC_(l)′ and C_(p)′ proportionally according to the importance values ofthe left subset C_(l) and the right subset C_(r).
 3. The method of claim2, wherein the display portion C_(p)′ is in the center of the displayarea.
 4. The method of claim 2, wherein the display portion C_(m)′ isbeneath the display portion C_(p)′.
 5. The method of claim 2, whereinthe display portions C_(l)′ and C_(r)′ are on the two opposite sides ofthe display portion C_(p)′.
 6. The method of claim 5, wherein: if thewidth is greater than the height of one or more display portions C_(m)′,C_(l)′ and C_(r)′, the first division, the second division and the thirddivision are performed iteratively for the lower subset C_(m), the leftsubset C_(l) or the right subset C_(r), respectively, until there isonly one graph component left in each subset; and if the width is lessthan the height of one or more of the display portions C_(m)′, C_(l)′ orC_(r)′, the respective display portions C_(m)′, C_(l)′ or C_(r)′ is 90degrees and then the first division, the second division and the thirddivision are iteratively performed for the lower subset C_(m), the leftsubset C_(l) or the right subset C_(r), respectively, until there isonly one graph component left in each subset.
 7. The method of claim 6,wherein triple tree structure is used to save the information of thedivision of the display area.
 8. A layout system for displaying multiplegraph components in a display area in a disconnected dynamic network,the system comprising: a first division means for selecting a testthreshold member of the multiple graph components, and for performing afirst division to divide the multiple graph components into a firstsubset S₁ and a second subset S₂ according to the order of theirimportance values, wherein each of the graph components in the firstsubset S₁ has an importance value greater than or equal to theimportance value of the test threshold member, and wherein each of thegraph components of the second subset S₂ has an importance value lessthan or equal to the importance value of the test threshold member; asecond division means for performing a second division to divide thefirst subset S₁ into an upper subset C_(p), which includes only the mostimportant graph component,. and a lower subset C_(m) which includes theother graph components; a first display area division means for dividingthe display area into display portions S₁′ and S₂′ proportionallyaccording to the importance values of the first subset S₁ and the secondsubset S₂; a second display area division means for dividing the displayportion S₁′ into display portions C_(p)′ and C_(m)′ proportionallyaccording to the importance values of the upper subset C_(p)and thelower subset C_(m); and an executing means for: causing execution by (i)the first division means, (ii) the second division means and (iii) thecorresponding display division means iteratively until the aspect ratioof display portion C_(p)′ is approximately 1; selecting, as a finalthreshold member, the importance value of the test threshold member thatresulted in the aspect ratio of the display portion C_(p) beingapproximately 1; and selecting for the display area a layout resultingfrom the dividing the display area into display portions and thedividing the display portion S₁′, wherein the divisions are performedwith the importance value of the final threshold member.
 9. The systemof claim 8, further comprising, a third division means for dividing thesubset S₂ into a left subset C_(l) and a right subset C_(r), in whichthe total importance value of the left subset C_(l) and of the rightsubset C_(r) are approximately equal; and a third display area divisionmeans for dividing the display portion S₂′ into display portions C_(l)′and C_(p)′ proportionally according to the importance values of the leftsubset C_(l) and the right subset C_(r).
 10. The system of claim 9,wherein the display portion C_(p)′ is in the center of the display area.11. The system of claim 9, wherein the display portion C_(m)′ is beneaththe display portion C_(p)′.
 12. The system of claim 9, wherein thedisplay portions C_(l)′ and C_(r)′ are on the two opposite sides of thedisplay portion C_(p)′.
 13. The system of claim 12, wherein the systemis configured so that: if the width is greater than the height for anyof the display portions C_(m)′, C_(l)′ and C_(r)′, the first division,the second division and the division of the display area are iterativelyperformed for the respective subsets, until there is only one graphcomponent left in each subset; and If the width is less than the heightfor any of the display portions C_(m)′, C_(l)′ and C_(r)′, such displayportions are rotated 90 degrees and then the first division, the seconddivision and the division of the display area are iteratively performedfor the respective subsets until there is only one graph component leftin each subset.
 14. The system of claim 13, wherein triple treestructure is used to save the information of the division of the displayarea.